An alternative formulation for a new closed cone constraint qualification
نویسندگان
چکیده
We give an alternative formulation for the so-called closed cone constraint qualification (CCCQ) related to a convex optimization problem in Banach spaces recently introduced in the literature. This new formulation allows to prove in a simple way that (CCCQ) is weaker than some generalized interiorpoint constraint qualifications given in the past. By means of some insights from the theory of conjugate duality we also show that strong duality still holds under some weaker hypotheses than the ones considered so far in the literature.
منابع مشابه
On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming
Dual characterizations of the containment of a convex set with quasiconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.
متن کاملStrong Duality in Robust Convex Programming: Complete Characterizations
Abstract. Duality theory has played a key role in convex programming in the absence of data uncertainty. In this paper, we present a duality theory for convex programming problems in the face of data uncertainty via robust optimization. We characterize strong duality between the robust counterpart of an uncertain convex program and the optimistic counterpart of its uncertain Lagrangian dual. We...
متن کاملConstraint qualification failure in action
This note presents a theoretical analysis of disjunctive constraints featuring unbounded variables. In this framework, classical modeling techniques, including big-M approaches, are not applicable. We introduce a lifted second-order cone formulation of such on/off constraints and discuss related constraint qualification issues. A solution is proposed to avoid solvers’ failure.
متن کاملExact duality for optimization over symmetric cones
We present a strong duality theory for optimization problems over symmetric cones without assuming any constraint qualification. We show important complexity implications of the result to semidefinite and second order conic optimization. The result is an application of Borwein and Wolkowicz’s facial reduction procedure to express the minimal cone. We use Pataki’s simplified analysis and provide...
متن کاملSome constraint qualifications for quasiconvex vector-valued systems
In this paper, we consider minimization problems with a quasiconvex vector-valued inequality constraint. We propose two constraint qualifications, the closed cone constraint qualification for vector-valued quasiconvex programming (the VQ-CCCQ) and the basic constraint qualification for vector-valued quasiconvex programming (the VQ-BCQ). Based on previous results by Benoist, Borwein, and Popovic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006